|
Let = , the hyperoperation. Invented by Jonathan Bowers, the first operator is and it's defined: ⋮ The number inside the brackets can change. If it's two ⋮ Operators beyond can also be made, the rule of it is the same as hyperoperation: The next level of operators is , it to behaves like is to . For every fixed positive integer , there is an operator with sets of brackets. The domain of is , and the codomain of the operator is . Another function means , where is the number of sets of brackets. It satisfies that for all integers , , , and . The domain of is , and the codomain of the operator is . Numbers like TREE(3) are unattainable with Bowers' operators, but Graham's number lies between and . ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Bowers' operators」の詳細全文を読む スポンサード リンク
|